A case study in mechanically deriving dense linear algebra code
نویسندگان
چکیده
Design by Transformation (DxT) is a top-down approach to mechanically derive high-performance algorithms for dense linear algebra. We use DxT to derive the implementation of a representative matrix operation, twosided Trmm. We start with a knowledge base of transformations that were encoded for a simpler set of operations, the level-3 BLAS, and add only a few transformations to accommodate the more complex twosided Trmm. These additions explode the search space of our prototype system, DxTer, requiring the novel techniques defined in this paper to eliminate large segments of the search space that contain suboptimal algorithms. Performance results for the mechanically optimized implementations on 8,192 cores of a BlueGene/P architecture are given.
منابع مشابه
Code Generation to Aid Parallel Code Development
Design by Transformation (DxT) encodes domain-specific software design knowledge as graph rewrites; a tool applies these rewrites to a specification (an initial graph) to automatically derive the most efficient implementation of that graph (code). Previously, we used DxT to generate high-performance, distributed-memory dense linear algebra (DLA) code for the level-3 Basic Linear Algebra Subprog...
متن کاملMechanical Translation of Set Theoretic Problem Specifications into Efficient RAM Code - A Case Study
This paper illustrates a fully automatic top-down approach to program development in which formal problem specifications are mechanically translated into efficient RAM code. This code is guaranteed to be totally correct and an upper bound on its worst case asymptotic running time is automatically determined. The user is only required to supply the system with a formal problem specification, and...
متن کاملDesigning Linear Algebra Algorithms by Transformation: Mechanizing the Expert Developer Regular Paper
To implement dense linear algebra algorithms for distributed-memory computers, an expert applies knowledge of the domain, the target architecture, and how to parallelize common operations. This is often a rote process that becomes tedious for a large collection of algorithms. We have developed a way to encode this expert knowledge such that it can be applied by a system to generate mechanically...
متن کاملDesigning Linear Algebra Algorithms by Transformation: Mechanizing the Expert Developer
To implement dense linear algebra algorithms for distributed-memory computers, an expert applies knowledge of the domain, the target architecture, and how to parallelize common operations. This is often a rote process that becomes tedious for a large collection of algorithms. We have developed a way to encode this expert knowledge such that it can be applied by a system to generate mechanically...
متن کاملA note on power values of generalized derivation in prime ring and noncommutative Banach algebras
Let $R$ be a prime ring with extended centroid $C$, $H$ a generalized derivation of $R$ and $ngeq 1$ a fixed integer. In this paper we study the situations: (1) If $(H(xy))^n =(H(x))^n(H(y))^n$ for all $x,yin R$; (2) obtain some related result in case $R$ is a noncommutative Banach algebra and $H$ is continuous or spectrally bounded.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJHPCA
دوره 27 شماره
صفحات -
تاریخ انتشار 2013